On Rational Radii Coin Representations of the Wheel Graph
نویسندگان
چکیده
A flower is a coin graph representation of the wheel graph. A petal of a flower is an outer coin connected to the center coin. The results of this paper are twofold. First we derive a parametrization of all the rational (and hence integer) radii coins of the 3-petal flower, also known as Apollonian circles or Soddy circles. Secondly we consider a general n-petal flower and show there is a unique irreducible polynomial Pn in n variables over the rationals Q, the affine variety of which contains the cosinus of the internal angles formed by the center coin and two consecutive petals of the flower. In that process we also derive a recursion that these irreducible polynomials satisfy.
منابع مشابه
On the maximum number of edges of non-flowerable coin graphs
For n ∈ N and 3 ≤ k ≤ n we compute the exact value of Ek(n), the maximum number of edges of a simple planar graph on n vertices where each vertex bounds an l-gon where l ≥ k. The lower bound of Ek(n) is obtained by explicit construction, and the matching upper bound is obtained by using Integer Programming (IP.) We then use this result to conjecture the maximum number of edges of a non-flowerab...
متن کاملdominating subset and representation graph on topological spaces
Let a topological space. An intersection graph on a topological space , which denoted by , is an undirected graph which whose vertices are open subsets of and two vertices are adjacent if the intersection of them are nonempty. In this paper, the relation between topological properties of and graph properties of are investigated. Also some classifications and representations for the graph ...
متن کاملConvex and Discrete Geometry
Geir Agnarsson, Jill Bigley Dunham.* George Mason University, Fairfax, VA. Extremal coin graphs in the Euclidean plane. A coin graph is a simple geometric intersection graph where the vertices are represented by non-overlapping closed disks in the Euclidean plane and where two vertices are connected if their corresponding disks touch. The problem of determining the maximum number of edges of a ...
متن کامل3-difference cordial labeling of some cycle related graphs
Let G be a (p, q) graph. Let k be an integer with 2 ≤ k ≤ p and f from V (G) to the set {1, 2, . . . , k} be a map. For each edge uv, assign the label |f(u) − f(v)|. The function f is called a k-difference cordial labeling of G if |νf (i) − vf (j)| ≤ 1 and |ef (0) − ef (1)| ≤ 1 where vf (x) denotes the number of vertices labelled with x (x ∈ {1, 2 . . . , k}), ef (1) and ef (0) respectively den...
متن کاملTHE RATIONAL CHARACTER TABLE OF SPECIAL LINEAR GROUPS
In this paper we will give the character table of the irreducible rational representations of G=SL (2, q) where q= , p prime, n>O, by using the character table and the Schur indices of SL(2,q).
متن کامل